Realistic Constrained Multiobjective Optimization Benchmark Problems From Design
نویسندگان
چکیده
Multiobjective optimization is increasingly used in engineering to design new systems and identify tradeoffs. Yet, problems often have objective functions constraints that are expensive highly nonlinear. Combinations of these features lead poor convergence diversity loss with common algorithms not been specifically designed for constrained optimization. Constrained benchmark exist, but they do necessarily represent the challenges problems. In this article, a framework electro-mechanical actuators, called multiobjective actuators (MODAct), presented 20 test derived from specific focus on constraints. The full source code made available ease its use. effects analyzed through their impact Pareto front as well performance. A constraint landscape analysis approach followed extended three metrics characterize search spaces. MODAct compared existing suites highlight differences. addition, using NSGA-II, NSGA-III, C-TAEA suggests indeed difficult due particular, number simultaneously violated newly generated solutions seems key understanding challenges. Thus, offers an efficient analyze handle future algorithm design.
منابع مشابه
Multiobjective Optimization of Mixed Variable Design Problems
In this paper, a new multiobjective genetic algorithm is employed to support the design of a hydraulic actuation system. First, the proposed method is tested using benchmarks problems gathered from the literature. The method performs well and it is capable of identifying multiple Pareto frontiers in multimodal function spaces. Secondly, the method is applied to a mixed variable design problem w...
متن کاملMobes: a Multiobjective Evolution Strategy for Constrained Optimization Problems
In this paper a new MultiOBjective Evolution Strategy (MOBES) for solving multi-objective optimization problems subject to linear and nonlinear constraints is presented. MOBES is based on the new concept of C-, F-and N-tness, which allows systematically to handle constraints and (in)feasible individuals. The existence of niche infeasible individuals in every population enables to explore new ar...
متن کاملQuasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملConstrained Multiobjective Biogeography Optimization Algorithm
Multiobjective optimization involves minimizing or maximizing multiple objective functions subject to a set of constraints. In this study, a novel constrained multiobjective biogeography optimization algorithm (CMBOA) is proposed. It is the first biogeography optimization algorithm for constrained multiobjective optimization. In CMBOA, a disturbance migration operator is designed to generate di...
متن کاملMemory Design for Constrained Dynamic Optimization Problems
A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary algorithm. Based on ideas from abstract memory, two schemes, blending and censoring, are introduced and tested. Using a new benchmark we show in numerical experiments that such a memory can improve solving certain types of constrained dynamic problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2021
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2020.3020046